home *** CD-ROM | disk | FTP | other *** search
- Path: plato.ansa.co.uk!news
- From: tms@ansa.co.uk (Toby Speight)
- Newsgroups: comp.lang.c++
- Subject: Re: Tough FACTORIAL math problem...
- Date: 16 Feb 1996 10:42:49 GMT
- Organization: ANSA, Cambridge, England.
- Sender: tms@socrates.ansa.co.uk
- Message-ID: <s891i3y2pc.fsf@socrates.ansa.co.uk>
- References: <4fr8be$ass@news.iconn.net> <31224679.6193@born.com>
- <4fvp9v$sso@newsroom.hitc.com> <4g0dla$hgg@newsroom.hitc.com>
- NNTP-Posting-Host: socrates.ansa.co.uk
- Mime-Version: 1.0
- Content-Type: text/plain; charset=US-ASCII
- Content-Transfer-Encoding: 7bit
- In-reply-to: psand@eos.hitc.com's message of 15 Feb 1996 22:55:38 GMT
- X-Yow: Hand me a pair of leather pants and a CASIO keyboard
- -- I'm living for today!
- X-Newsreader: Gnus v5.1
-
- >>>>> In article <4g0dla$hgg@newsroom.hitc.com>,
- >>>>> Patrick == "G Patrick Sand" <psand@eos.hitc.com> writes:
-
- Patrick> Oh, by the way, the least significant digit for N! base 2 is
- Patrick> ONE, when N is 1 or larger; the rest is left as an amusing
- Patrick> exercise for the reader...
-
- As is the generalisation to N being 0 or larger ;-)
- --
- Toby Speight <tms@ansa.co.uk> Phone +44 1223 568925, Fax +44 1223 359779
- APM Ltd., Poseidon House, Castle Park, Cambridge CB3 0RD
-